Precoding Aided Generalized Spatial Modulation With an Iterative Greedy Algorithm
نویسندگان
چکیده
منابع مشابه
Performance Study of Precoding Techniques on Generalized Spatial Modulation with Correlated Antennas
Spatial modulation (SM) reduces transceiver complexity and inter-channel interference over traditional multiple input multiple output (MIMO) systems. It has been shown recently in the literature that the use of a precoder in an SM or a generalized spatial modulation (GSM) system can significantly improve error performance. This paper investigates two issues related to precoders: 1) the use of a...
متن کاملArtificial-noise-aided Secure Multicast Precoding for Directional Modulation Systems
In multi-cast scenario, all desired users are divided into K groups. Each group receives its own individual confidential message stream. Eavesdropper group aims to intercept K confidential-message streams. To achieve a secure transmission, two secure schemes are proposed: maximum group receive power plus null-space (NS) projection (Max-GRP plus NSP) and leakage. The former obtains its precoding...
متن کاملAn Iterative Algorithm for Generalized Mixed Equilibria with Variational Inequalities
In this paper, we shall introduce an iterative algorithm by multi-step implicit hybrid steepestdescent method for finding a common element of the set of solutions of a finite family of generalized mixed equilibrium problems, the set of solutions of a finite family of variational inequalities for inverse strongly monotone mappings and the set of fixed points of a countable family of nonexpansive...
متن کاملAn accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations
In this paper, an accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations is proposed. The convergence analysis of the algorithm is investigated. We show that the proposed algorithm converges to the exact solution for any initial value under certain assumptions. Finally, some numerical examples are given to demons...
متن کاملGeneralized Greedy Algorithm for Shortest Superstring
In the primitive greedy algorithm for shortest superstring, if a pair of strings with maximum overlap picked out, they are subsequently merged. In this paper, we introduce the concept of optimal set and generalize the primitive greedy algorithm. The generalized algorithm can be reduced to the primitive greedy algorithm if the relative optimal set is empty. Consequently, the new algorithm achiev...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2018
ISSN: 2169-3536
DOI: 10.1109/access.2018.2880844